全文获取类型
收费全文 | 493篇 |
免费 | 75篇 |
国内免费 | 17篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 1篇 |
2019年 | 14篇 |
2018年 | 6篇 |
2017年 | 25篇 |
2016年 | 39篇 |
2015年 | 19篇 |
2014年 | 23篇 |
2013年 | 77篇 |
2012年 | 37篇 |
2011年 | 36篇 |
2010年 | 27篇 |
2009年 | 33篇 |
2008年 | 38篇 |
2007年 | 43篇 |
2006年 | 38篇 |
2005年 | 20篇 |
2004年 | 25篇 |
2003年 | 15篇 |
2002年 | 17篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1992年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有585条查询结果,搜索用时 484 毫秒
1.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
2.
An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression 下载免费PDF全文
Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA. 相似文献
3.
张保平 《中国人民武装警察部队学院学报》2008,24(1):6-9
公安边防部门取得刑事侦查权,是侦查体制改革的结果。但在边防管辖和查办案件的种类、边防海警刑事办案权的实现、边防检查站查获的刑事案件的管辖、公安边防部门侦查主体资格的完善等方面,还应继续改革.使边防部门刑事侦查机制不断完善。 相似文献
4.
5.
6.
7.
8.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
9.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
10.
李冬云 《国防科技大学学报》2000,22(2):78-81
给出了计算机通信网中的窗体制描述 ,针对数据链路层和网络层运用的窗体制 ,分别进行了分析。讨论了不同层次上窗体制运用中的参数 ,列出了一种窗体制具体形式的程序流程图 相似文献